翻訳と辞書 Words near each other ・ Generation Next (disambiguation) ・ Generation Nothing ・ Generation O! ・ Generation of '27 ・ Generation of '36 ・ Generation of '50 ・ Generation of '80 ・ Generation of '98 ・ Generation of 1928 ・ Generation of Animals ・ Generation of binomial series using calculus ・ Generation of Chaos ・ Generalized Pochhammer symbol ・ Generalized Poincaré conjecture ・ Generalized polygon ・ Generalized processor sharing ・ Generalized Procrustes analysis ・ Generalized pustular psoriasis ・ Generalized quadrangle ・ Generalized quantifier ・ Generalized randomized block design ・ Generalized relative entropy ・ Generalized Riemann hypothesis ・ Generalized second-price auction ・ Generalized selection ・ Generalized semi-infinite programming ・ Generalized signal averaging ・ Generalized singular value decomposition ・ Generalized spectrogram ・ Generalized star height problem Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Generalized processor sharing ： ウィキペディア英語版 Generalized processor sharing Generalized processor sharing (GPS) is an ideal scheduling algorithm for network schedulers. It is related to the Fair queuing principle, that groups the packets into classes, and share the service capacity between them. The GPS shares this capacity ''according to some fixed weights''. In processor scheduling, generalized processor sharing is "an idealized scheduling algorithm that achieves perfect fairness. All practical schedulers approximate GPS and use it as a reference to measure fairness." Generalized processor sharing assumes that traffic is fluid (infinitesimal packet sizes), and can be arbitrarily split. There are several service disciplines which track the performance of GPS quite closely such as weighted fair queuing (WFQ), also known as packet-by-packet generalized processor sharing (PGPS). == Justification == In a network such as the internet, different application types require different levels of performance. For example, email is a genuinely store and forward kind of application, but videoconferencing isn't since it requires low latency. When packets are queued up on one end of a congested link, the node usually has some freedom in deciding the order in which it should send the queued packets. One example ordering is simply first-come, first-served, which works fine if the sizes of the queues are small, but can result in problems if there are latency sensitive packets being blocked by packets from bursty, higher bandwidth applications. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Generalized processor sharing」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.